Maximum Block Improvement Method and Its Applications
نویسندگان
چکیده
We consider compressed sensing of piecewise constant signals, which have sparse gradients and arise frequently from problems of practical interests. We use total variation minimization to recover such signals from a small number of measurements. We establish the proof for the performance guarantee of total variation (TV) minimization in recovering one-dimensional signal with sparse gradient support. In particular, we have shown that the recoverable gradient sparsity can grow linearly with the signal dimension when TV minimization is used. (Joint work with Weiyu Xu from Department of Electrical and Computer Engineering, University of Iowa)
منابع مشابه
On Convergence of the Maximum Block Improvement Method
The so-called MBI (maximum block improvement) method is a greedy type approach to solve optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is relatively easy, the MBI method then advocates to update the block of variables corresponding to the maximally improving block at e...
متن کاملMaximum Block Improvement and Polynomial Optimization
In this paper we propose an efficient method for solving the spherically constrained homogeneous polynomial optimization problem. The new approach has the following three main ingredients. First, we establish a block coordinate descent type search method for nonlinear optimization, with the novelty being that we only accept a block update that achieves the maximum improvement, hence the name of...
متن کاملOptimum Design of a Three-Phase Permanent Magnet Synchronous Motor for industrial applications
Permanent Magnet Synchronous Motors (PMSMs) have been widely used in many industrial applications. In This paper a new method for multi objective optimal design of a permanent magnet synchronous motor (PMSMs) with surface mounted permanent magnet rotor is presented to achieve maximum efficiency and power density using a Bees algorithm for industrial applications. The objective function is a...
متن کاملAn Improvement in WRP Block Replacement Policy with Reviewing and Solving its Problems
One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To o...
متن کاملAn Improvement in WRP Block Replacement Policy with Reviewing and Solving its Problems
One of the most important items for better file system performance is efficient buffering of disk blocks in main memory. Efficient buffering helps to reduce the widespeed gap between main memory and hard disks. In this buffering system, the block replacement policy is one of the most important design decisions that determines which disk block should be replaced when the buffer is full. To o...
متن کاملOn Tensor Tucker Decomposition: the Case for an Adjustable Core Size
This paper is concerned with the problem of finding a Tucker decomposition for tensors. Traditionally, solution methods for Tucker decomposition presume that the size of the core tensor is specified in advance, which may not be a realistic assumption in some applications. In this paper we propose a new computational model where the configuration and the size of the core become a part of the dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013